A Swedish Clause Grammar And Its Implementation
نویسنده
چکیده
The paper is concerned with the notion of clause as a basic, minimal unit for the segmentation and processing of natural language. The first part of the paper surveys various criteria for clausehood that have been proposed in theoretical linguistics and computational linguistics, cind pro poses that a clause in English or Swedish or any other natural language can be defined in structural terms at the surface level as a regular expression of syntactic categories, equivalently, as a set of sequences of word classes, a possibility which has been explicitly denied by Harris (1968) and later transformational grammarians. The second part of the paper presents a grammar for Swedish clauses, and a newspaper text segmented into clauses by an experimental clause parser intended for a speech synthesis applicar tion. The third part of the paper presents some phonetic data concerning the distribution of perceived pauses (Strangert and Zhi 1989, Strangert 1989) and intonation units (Huber 1988) in relation to clause units. 1 What is a Clause in Linguistic Theory? In trad ition a l gram m ar a clause is defined as a unit consisting o f a su b ject and a pred icate . T h e term s su ppositu m and appositu m were used in scholastic gram m ar to den ote the synttictic fu n ction s o f these tw o basic parts o f a clause. T rad itiona l gram m ar malces a d istin ction betw een m ain clauses and dependent clauses. In current tran sform ation al gram m ar as presented by R adford (1988 ), three typ es o f clauses are recogn ized (see (1 )). (1 ) (a ) O rd in ary Clauses S'
منابع مشابه
Using Focus to Generate Complex and Simple Sentences
One problem for the generation of natural language text is determining when to use a sequence of simple sentences and when a single complex one is more appropriate. In this paper, we show how focus of attention is one factor that influences this decision and describe its implementation in a system that generates explanations for a student advisor expert system. The implementation uses tests on ...
متن کاملAttribute Grammars
Attribute grammars are a framework for defining semantics of programming languages in a syntax-directed fashion. In this paper, we define attribute grammars, and then illustrate their use for language definition, compiler generation, definite clause grammars, design and specification of algorithms, etc. Our goal is to emphasize its role as a tool for design, formal specification and implementat...
متن کاملCompiling HPSG Type Constraints into Definite Clause Programs
We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their implementation. The compiler performs off-line constraint inheritance and code optimization. As a result, we are able to efficiently process with HPSG grammars with...
متن کاملA Generalized Greibach Normal Form for Definite Clause Grammars
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for context-free grammars. The normalized definite clause grammar is declaratively equivalent to the original definite clause grammar, that is, it assigns the same analyses to the same strings. Offline-parsability of the ...
متن کاملImplementing The Generalized Word Order Grammars Of Chomsky And Diderichsen
Many of the insights of Transformational Grammar (TG) concern the movability of const i tuents . But in recent versions (Government & Binding, GB; cf. Chomsky, 1982, Sells,1985) the sentence representations (trees) include both the site of the moved constituent and the site from where it has been moved; the original site of the moved constituent is marked as a trace (t) or empty (e, []). In the...
متن کامل